Lattice polytopes cut out by root systems and the Koszul property

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattice polytopes cut out by root systems and the Koszul property

We show that lattice polytopes cut out by root systems of classical type are normal and Koszul, generalizing a well-known result of Bruns, Gubeladze, and Trung in type A. We prove similar results for Cayley sums of collections of polytopes whose Minkowski sums are cut out by root systems. The proofs are based on a combinatorial characterization of diagonally split toric varieties.

متن کامل

Normal Polytopes, Triangulations, and Koszul Algebras

This paper is devoted to the algebraic and combinatorial properties of polytopal semigroup rings defined as follows. Let P be a lattice polytope in R n , i. e. a poly-tope whose vertices have integral coordinates, and K a field. Then one considers the embedding ι : R n → R n+1 , ι(x) = (x, 1), and defines S P to be the semigroup generated by the lattice points in ι(P); the K-algebra K[S P ] is ...

متن کامل

Multigraded regularity and the Koszul property

We give a criterion for the section ring of an ample line bundle to be Koszul in terms of multigraded regularity. We discuss applications to adjoint bundles on toric varieties as well as to polytopal semigroup rings.

متن کامل

The even and odd cut polytopes

Deza, M. and M. Laurent, The even and odd cut polytopes, Discrete Mathematics 119 (1993) 49966. The cut polytope P, is the convex hull of the incidence vectors of all cuts of the complete graph K, on n nodes. An even cut is a cut of even cardinality. For n odd, all cuts are even. For n even, we consider the even cut polytope EvP,, defined as the convex hull of the incidence vectors of all even ...

متن کامل

polymake and Lattice Polytopes

The polymake software system deals with convex polytopes and related objects from geometric combinatorics. This note reports on a new implementation of a subclass for lattice polytopes. The features displayed are enabled by recent changes to the polymake core, which will be discussed briefly.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2009

ISSN: 0001-8708

DOI: 10.1016/j.aim.2008.10.008